Interactive Image Segmentation using Graph Cuts

نویسنده

  • Mayuresh Kulkarni
چکیده

This paper presents an accurate interactive image segmentation tool using graph cuts and image properties. Graph cuts is a fast algorithm for performing binary segmentation, used to find the global optimum of a cost function based on the region and boundary properties of the image. The user marks certain pixels as background and foreground, and Gaussian mixture models (GMMs) for these classes are built using the colour and texture features of corresponding pixels. A likelihood ratio is used to calculate the relative probability of each pixel being foreground or background, based on the GMMs. Many features and their combinations are analyzed on images from the Berkeley Segmentation Dataset. Results of different segmentations are compared using precision-recall curves, F-score and accuracy. The average accuracy of the algorithm was 92% over a set of 20 images and the best accuracy was 99.5%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparative performance of gray level image thresholding using normalized graph cut based standard S membership function

In this research paper, we use a normalized graph cut measure as a thresholding principle to separate an object from the background based on the standard S membership function. The implementation of the proposed algorithm known as fuzzy normalized graph cut method. This proposed algorithm compared with the fuzzy entropy method [25], Kittler [11], Rosin [21], Sauvola [23] and Wolf [33] method. M...

متن کامل

Interactive Automatic Hepatic Tumour CT Image Segmentation

The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. They avoid the boundary-length bias of graph-cut methods and results in increased sensitivity to seed placement. A new proposed method of fully automatic processing frameworks is given based on Graph-cut and Geodesic Graph cut algorithms. This paper addresses the prob...

متن کامل

Interactive Segmentation of Lung Nodules using AdaBoost and Graph Cuts

In this paper, we propose an interactive method for lung nodule segmentation. Given a seed point, the segmentation process consisting of three steps is done automatically. The first step is intensity normalization. The second one is to build an energy function for graph cuts. The third one is to do the segmentation by graph cuts. In the third step, if there are imperfects in the result, we prov...

متن کامل

Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts

Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically segment Multiple Sclerosis (MS) lesions in MRI. We replace the manual interaction with a robust EM-based approach in order to discriminate between MS lesions and the Normal Appearing Brain Tissues (NABT). Evaluation is performed ...

متن کامل

Image Segmentation by Graph Cuts via Energy Minimization

Multiregion graph cut image partitioning via kernel mapping is used to segment any type of the image data. The image data is transformed by a kernel function so that the piecewise constant model of the graph cut formulation becomes applicable. The objective function contains an original data term to evaluate the deviation of the transformed data within each segmentation region, from the piecewi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009